Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

from(X) → cons(X, n__from(s(X)))
first(0, Z) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
sel(0, cons(X, Z)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
first(X1, X2) → n__first(X1, X2)
activate(n__from(X)) → from(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → X

Q is empty.


QTRS
  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

from(X) → cons(X, n__from(s(X)))
first(0, Z) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
sel(0, cons(X, Z)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
first(X1, X2) → n__first(X1, X2)
activate(n__from(X)) → from(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → X

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:
0 > nil
sel2 > [from1, first2, activate1] > nfrom1
sel2 > [from1, first2, activate1] > s1 > [cons2, nfirst2]
sel2 > [from1, first2, activate1] > nil

Status:
from1: multiset
sel2: [1,2]
first2: multiset
nfrom1: multiset
s1: multiset
0: multiset
nil: multiset
cons2: [2,1]
nfirst2: multiset
activate1: multiset